An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry
نویسندگان
چکیده
Geographic database systems, known as geographic information systems (GISs) particularly among noncomputer scientists, are one of the most important applications of the very active research area named spatial database systems. Additionally to other spatial database systems where query and manipulation processing are emphasized, the most important purpose of a GIS is to analyze geographical data. The basic building block for analysis operations in GIS is the operation map overlay. However, available map overlay algorithms suffer from poor performance. In this paper, we present an efficient map overlay algorithm using as ingredients spatial access methods and state-of-the-art computational geometry concepts. An experimental performance analysis of our implemented map overlay algorithm demonstrates the fruitfulness of the marriage of spatial access methods with computational geometry methods for improving the efficiency of GISs. The possibility of coupling these two areas is based on the fact that both use spatial order relations in order to increase the performance of query processing.
منابع مشابه
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
We consider the problem of performing polygonal map overlay and the re nement step of spatial overlay joins. We show how to adapt algorithms from computational geometry to solve these problems for massive data sets. A performance study with arti cial and real-world data sets helps to identify the algorithm that should be used for given input data.
متن کاملThe Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems
Geographic database systems, known as geographic information systems (GISs) particularly among non-computer scientists, are one of the most important applications of the very active research area named spatial database systems. Consequently following the database approach, a GIS hag to be seamless, i.e. store the complete area of interest (e.g. the whole world) in one database map. For exhibiti...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملIntersection Detection of Convex Polygons
Detecting whether two geometric objects intersect and computing the region of intersection are fundamental problems in computational geometry. Geometric intersection problems arise naturally in a number of applications. Examples include geometric packing and covering, wire and component layout in VLSI, map overlay in geographic information systems, motion planning, and collision detection. In s...
متن کاملLoad Balancing in High Performance GIS: Declustering Polygonal Maps
A high performance geographic information system (GIS) is a central component of many real-time applications of spatial decision making. The GIS may contain gigabytes of geometric and feature data (e.g. location, elevation, soil type etc.) stored on a hierarchy of memory devices and represented as grids and large sets of polygons. The data is often accessed via range queries (like polygon clipp...
متن کامل